A polymorphic RPC calculus

Polymorphic lambda calculus and subtyping

We present a denotational model for F<, the extension of second-order lambda calculus with subtyping defined in [Cardelli Wegner 1985]. Types are interpreted as arbitrary cpos and elements of types as natural transformations. We prove the soundness of our model with respect to the equational theory of F< [Cardelli et al. 1991] and show coherence. Our model is of independent interest, because it...

Rewriting with Extensional Polymorphic λ-calculus

We provide a confluent and strongly normalizing rewriting system, based on expansion rules, for the extensional second order typed lambda calculus with product and unit types: this system corresponds to the Intuitionistic Positive Calculus with implication, conjunction, quantification over proposition and the constant True. This result is an important step towards a new theory of reduction base...

Full Abstraction for Polymorphic Pi-Calculus

The problem of finding a fully abstract model for the polymorphic π-calculus was stated in Pierce and Sangiorgi’s work in 1997 and has remained open since then. In this paper, we show that a slight variant of their language has a direct fully abstract model, which does not depend on type unification or logical relations. This is the first fully abstract model for a polymorphic concurrent langua...

Region Analysis and the Polymorphic Lambda Calculus

We show how to translate the region calculus of Tofte and Talpin, a typed lambda calculus that can statically delimit the lifetimes of objects, into an extension of the polymorphic lambda calculus called F#. We give a denotational semantics of F#, and use it to give a simple and abstract proof of the correctness of memory deallocation.

Metacircularity in the Polymorphic lambda-Calculus